煤矿5G分布式MIMO组网技术研究（增刊）

根据煤矿井下的安全防爆要求，天线的射频发射功率受到严格限制，导致煤矿5G的基站部署密度显著高于地面场景。为了解决由此引发的交叉覆盖问题，本文提出了煤矿5G分布式MIMO组网技术，利用分布在不同位置的天线实现对用户数据的联合并行发送，不仅避免了由交叉覆盖导致的乒乓切换等负面效应，还提升了边缘区域的信号覆盖效果。在乌兰木伦煤矿的300米采煤工作面内，利用分布式MIMO组网技术实现了5G信号的无边界覆盖，上行速率不低于500Mbps，保障了煤机数据的实时有效传输。     

磨料有序排布电镀砂轮的制备及其把持力研究

为解决电镀砂轮磨削加工中容屑空间不足的问题，采用点胶微粘接的方法制备了磨料有序排布的电镀砂轮，分析了磨料粘接效果和镀层力学性能。通过SEM分析了磨料/镀层/导电胶的结合界面，并进行了干磨削试验。研究结果表明，直径约为磨料粒径40%的胶点可粘接住磨料，单个胶点上粘接多颗磨料的占比小于6%；双脉冲电镀工艺制备的镀层显微硬度大于500HV，表层残余应力小于100MPa，磨料/镀层/导电胶之间的界面贴合紧密，无明显缺陷；砂轮在磨削时没有出现磨料脱落现象。     

Distributed two‐stage state estimation with event‐triggered strategy for multirate sensor networks

This paper investigates the state estimation issue for a class of wireless sensor networks (WSNs) with the consideration of limited energy resources. First, a multirate estimation model is established, and then, a new event‐triggered two‐stage information fusion algorithm is developed based on the optimal fusion criterion weighted by matrices. Compared with the existing methods, the presented fusion algorithm can significantly reduce the communication cost in WSNs and save energy resources of sensors efficiently. Furthermore, by presetting a desired containment probability over the interval [0,1] with the developed event‐triggered mechanism, one can obtain a suitable compromise between the communication cost and the estimation accuracy. Finally, a numerical simulation for the WSN tracking system is given to demonstrate the effectiveness of the proposed method.     

Cryptographic Lightweight Encryption Algorithm with Dimensionality Reduction in Edge Computing

Edge Computing is one of the radically evolving systems through generations as it is able to effectively meet the data saving standards of consumers, providers and the workers. Requisition for Edge Computing based items have been increasing tremendously. Apart from the advantages it holds, there remain lots of objections and restrictions, which hinders it from accomplishing the need of consumers all around the world. Some of the limitations are constraints on computing and hardware, functions and accessibility, remote administration and connectivity. There is also a backlog in security due to its inability to create a trust between devices involved in encryption and decryption. This is because security of data greatly depends upon faster encryption and decryption in order to transfer it. In addition, its devices are considerably exposed to side channel attacks, including Power Analysis attacks that are capable of overturning the process. Constrained space and the ability of it is one of the most challenging tasks. To prevail over from this issue we are proposing a Cryptographic Lightweight Encryption Algorithm with Dimensionality Reduction in Edge Computing. The t-Distributed Stochastic Neighbor Embedding is one of the efficient dimensionality reduction technique that greatly decreases the size of the non-linear data. The three dimensional image data obtained from the system, which are connected with it, are dimensionally reduced, and then lightweight encryption algorithm is employed. Hence, the security backlog can be solved effectively using this method.     

基于查询的新闻多文档自动摘要技术研究

针对新闻文本领域,该文提出一种基于查询的自动文本摘要技术,更加有针对性地满足用户信息需求。根据句子的TF-IDF、与查询句的相似度等要素,计算句子权重,并根据句子指示的时间给定不同的时序权重系数,使得最近发生的新闻内容具有更高的权重,最后使用最大边界相关的方法选择摘要句。通过与基于TF-IDF、Text-Rank、LDA等六种方法的对比,该摘要方法ROUGE评测指标上优于其他方法。从结合评测结果及摘要示例可以看出,该文提出的方法可以有效地从新闻文档集中摘取核心信息,满足用户查询内容的信息需求。     

负径向电场对带电粒子俘获率影响的数值模拟

本文采用数值方法求解Grad-Shafranov方程反演EAST典型长脉冲放电实验(炮号33068)的平衡位形和磁场分布，进而结合粒子在托卡马克电磁场中的运动方程，模拟氘离子在负径向电场存在时的运动轨迹，并统计不同负径向电场下的氘离子俘获率。结果表明：随负径向电场的增大，氘离子轨迹由扩张通行轨迹向外翻香蕉轨迹再向内翻香蕉轨迹，最后向压缩通行轨迹演变；氘离子俘获率随负径向电场的增大而减小，氘离子初始速度越小，其变化越大。     

A platform for P2P agent-based collaborative applications

The operational environment can be a valuable source of information about the behavior of software applications and their usage context. Although a single instance of an application has limited evidence of the range of the possible behaviors and situations that might be experienced in the field, the collective knowledge composed by the evidence gathered by the many instances of a same application running in several diverse user environments (eg, a browser) might be an invaluable source of information. This information can be exploited by applications able to autonomously analyze how they behave in the field and adjust their behavior accordingly. Augmenting applications with the capability to collaborate and directly share information about their behavior is challenging because it requires the definition of a fully decentralized and dependable networked infrastructure whose nodes are the user machines. The nodes of the infrastructure must be collaborative, to share information, and autonomous, to exploit the available information to change their behavior, for instance, to better accommodate the needs of the users to prevent known problems. This paper describes the initial results that we obtained with the design and the development of an infrastructure that can enable the execution of collaborative scenarios in a fully decentralized way. Our idea is to combine the agent-based paradigm, which is well suited to design collaborative and autonomous nodes, and the peer-to-peer paradigm, which is well suited to design distributed and dynamic network infrastructures. To demonstrate our idea, we augmented the popular JADE agent-based platform with a software layer that supports both the creation of a fully decentralized peer-to-peer network of JADE platforms and the execution of services within that network, thus enabling JADE multiagent systems (MASs) to behave as peer-to-peer networks. The resulting platform can be used to study the design of collaborative applications running in the field.     

单自由度八杆仿生机构构型与尺度同步设计方法

单自由度八杆仿生机构杆长参数较多，是仿生机器人领域研究的难点之一。为提高设计效率，提出一种构型与尺度同步设计方法。在选定的运动链和机架的基础上，以不等式形式分步给出运动可行性及外形约束条件，使得上一步的杆长可作为下一步求解的已知值。通过该过程，在得到八杆仿生机构构型的同时，快速得到所有杆长的初步可行域。循环上述过程，逐步缩小约束条件的范围，可使得八杆机构的杆长快速接近目标值。在此基础上，分类讨论了连杆搭接顺序、约束条件及基本运动链的差异对求解难度及构型结果的影响。利用所提出的单自由度八杆仿生机构的设计方法，在对初始条件进行合理选取的前提下，可在初步得到构型的同时将杆长限定在较小范围内，实现了构型与尺度的同步设计。该方法还可应用于其他单自由度机构的设计当中，具有较好的借鉴意义。     

Scheduling distributed flowshops with flexible assembly and set-up time to minimise makespan

The scheduling problems under distributed production or flexible assembly settings have achieved increasing attention in recent years. This paper considers scheduling the integration of these two environments and proposes an original distributed flowshop scheduling problem with flexible assembly and set-up time. Distributed production stage is deployed several homogeneous flowshop factories that process the jobs to be assembled into final products in the flexible assembly stage. The objective is to find a schedule, including a production subschedule for jobs and an assembly subschedule for products, to minimise the makespan. Such a scheduling problem involves four successive decisions: assigning jobs to production factories, sequencing jobs at every factory, designating an assembly machine for each product and sequencing products on each assembly machine. The computational model is first established, and then a constructive heuristic (TPHS) and two hybrid metaheuristics (HVNS and HPSO) are proposed. Numerical experiments have been carried out and results validate the algorithmic feasibility and effectiveness. TPHS can obtain reasonable solutions in a shorter time, while metaheuristics can report better solutions using more yet acceptable time. HPSO is statistically comparable yet less robust compared with HVNS for small-scale instances. For the large-scale case, HPSO outperforms HVNS on both effectiveness and robustness.